|
|
Copy Detection
Kletzander, Martin ; Zemčík, Pavel (referee) ; Hradiš, Michal (advisor)
This thesis describes content-search methods. Chosen method is applied on finding similar images and video frames. Thesis also qualifies methods used for acceleration of this search. Methods \ are then evauated and their results discussed. Proposal of commonly used enhancements for these methods is made.
|
|
|
Acceleration of Algorithms for Clustering of Tunnels in Proteins
Jaroš, Marta ; Vašíček, Zdeněk (referee) ; Martínek, Tomáš (advisor)
This thesis deals with the clustering of tunnels in data obtained from the protein molecular dynamics simulation. This process is very computationaly intensive and it has been a challenge for scientific communities. The goal is to find such an algorithm with optimal time and space complexity ratio. The research of clustering algorithms, work with huge highdimensional datasets, visualisation and cluster-comparing methods are discussed. The thesis provides a proposal of the solution of this problem using the Twister Tries algorithm. The implementation details are analysed and the testing results of the solution quality and space complexity are provided. The goal of the thesis was to prove that we could achieve the same results with a stochastic algorithm - Twister Tries , as with an exact algorithm ( average-linkage ). This assumption was not confirmed confidently. Another finding of the hashing functions analysis shows that we could obtain the same results of hashing with a low dimensional hashing function but in much better computational time.
|
|
|
Image Retrieval Based on Color Histograms
Sailer, Zbyněk ; Hradiš, Michal (referee) ; Beran, Vítězslav (advisor)
This thesis deals with description of existing methods of image retrieval. It contains set of methods for image description, coding of global and local descriptor (SIFT, etc.) and describes method of effective searching in multidimensional space (LSH). It continues with proposal and testing of three global descriptors using color histograms, histogram of gradients and the combination of both. The last part deals with similar image retrieval using proposed descriptors and the indexing method LSH and compares the results with the existing method. Product of this work is an experimental application which demonstrates the proposed solution.
|
|
|
K-Nearest Neighbour Search Methods
Cigánik, Marek ; Bartík, Vladimír (referee) ; Burgetová, Ivana (advisor)
The thesis describes the basic concept of the K-nearest neighbors algorithm and its connection with the human concept of object similarity. Concepts and key ideas such as the distance function or the curse of dimensionality are elaborated. The work includes a detailed description of the methods KD-Tree, Spherical Tree, Locality-Sensitive Hashing, Random Projection Tree and families of algorithms based on the nearest neighbor graph. An explanation of the idea with visualizations, pseudocodes and asymptotic complexities is provided for each method. The methods were subjected to experiments and both basic and more advanced metrics were measured and appropriate use cases for individual methods were evaluated.
|
|
|
Acceleration of Algorithms for Clustering of Tunnels in Proteins
Jaroš, Marta ; Vašíček, Zdeněk (referee) ; Martínek, Tomáš (advisor)
This thesis deals with the clustering of tunnels in data obtained from the protein molecular dynamics simulation. This process is very computationaly intensive and it has been a challenge for scientific communities. The goal is to find such an algorithm with optimal time and space complexity ratio. The research of clustering algorithms, work with huge highdimensional datasets, visualisation and cluster-comparing methods are discussed. The thesis provides a proposal of the solution of this problem using the Twister Tries algorithm. The implementation details are analysed and the testing results of the solution quality and space complexity are provided. The goal of the thesis was to prove that we could achieve the same results with a stochastic algorithm - Twister Tries , as with an exact algorithm ( average-linkage ). This assumption was not confirmed confidently. Another finding of the hashing functions analysis shows that we could obtain the same results of hashing with a low dimensional hashing function but in much better computational time.
|
|
|
Copy Detection
Kletzander, Martin ; Zemčík, Pavel (referee) ; Hradiš, Michal (advisor)
This thesis describes content-search methods. Chosen method is applied on finding similar images and video frames. Thesis also qualifies methods used for acceleration of this search. Methods \ are then evauated and their results discussed. Proposal of commonly used enhancements for these methods is made.
|
|
|
Image Retrieval Based on Color Histograms
Sailer, Zbyněk ; Hradiš, Michal (referee) ; Beran, Vítězslav (advisor)
This thesis deals with description of existing methods of image retrieval. It contains set of methods for image description, coding of global and local descriptor (SIFT, etc.) and describes method of effective searching in multidimensional space (LSH). It continues with proposal and testing of three global descriptors using color histograms, histogram of gradients and the combination of both. The last part deals with similar image retrieval using proposed descriptors and the indexing method LSH and compares the results with the existing method. Product of this work is an experimental application which demonstrates the proposed solution.
|
guest ::
